Fourier transforms and the 2-adic span of periodic binary sequences
نویسندگان
چکیده
An arithmetic or with-carry analog of Blahut’s theorem is presented. This relates the length of the smallest feedback with carry shift register to the number of nonzero classical Fourier coefficients of a periodic binary sequence.
منابع مشابه
Analytic Constructions of Periodic and Non-periodic Complementary Sequences
An analytic approach for the generation of non-periodic and periodic complementary sequences is advanced for lengths that are powers of two. The periodic complementary sequences can be obtained using symmetric or anti-symmetric extensions. The properties of their autocorrelation functions are studied. The non-periodic complementary sequences are the intersection between anti-symmetric and symme...
متن کاملComments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملp-adic Shearlets
The field $Q_{p}$ of $p$-adic numbers is defined as the completion of the field of the rational numbers $Q$ with respect to the $p$-adic norm $|.|_{p}$. In this paper, we study the continuous and discrete $p-$adic shearlet systems on $L^{2}(Q_{p}^{2})$. We also suggest discrete $p-$adic shearlet frames. Several examples are provided.
متن کامل2-Adic Shift Registers
Pseudorandom sequences, with a variety of statistical properties (such as high linear span, low autocorrelation and pairwise cross-correlation values, and high pairwise hamming distance) are important in many areas of communications and computing (such as cryptography, spread spectrum communications, error correcting codes, and Monte Carlo integration). Binary sequences~ such as m-sequences, mo...
متن کاملDesign of new pseudorandom generators based on a filtered FCSR automaton
Feedback with Carry Shift Registers (FCSR) were introduced by M. Goresky and A. Klapper in 1993. They are very similar to classical Linear Feedback Shift Registers (LFSR) used in many pseudorandom generators. The main difference is the fact that the elementary additions are not additions modulo 2 but with propagation of carries. In this paper we propose a new generator designed from a FCSR auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000